搜索资源列表
asil_egemen_findPrimesParallel.c
- MPI Efficient Finding Prime
Prime
- 输入一个整数数据并求大于该数据的的最小素数-Enter an integer data and the data request is greater than the smallest prime number
prime
- 实现两个四位素数之间的转换，每次变一位数 中间过程都是素数 要几次-Between the two prime numbers to achieve the conversion of four, each time varying the number of intermediate process is a prime number to be several times
prime
- 判断数字是否是质数，很好用的，对于小学生来说！-Determine whether the number is a prime number, the good, is for students!
ZHISHU
- 从键盘输入（0-65535）的一个十进制数并且输出小于它的所有素数-From the keyboard input (0-65535) and the output of a decimal number less than all of its prime
prime-number-1
- 素数填表问题 素数填表问题 素数填表问题 素数填表问题-Problems filling prime prime prime problem filling filling filling prime problem problems problem filling prime prime prime problem filling filling problems
Prime-
- 提供判断是否为素数的三种常用方法，其基本思想是用该数分别处以比其小的所有数，若只能1和其本身除尽则为素数；否则不是-Provided for the prime numbers to determine whether three commonly used methods, the basic idea is fine with the respectively smaller than the number of all, if only divisible by 1 and compare
judge-prime-number
- 利用labview中的公式节点，实现判断素数的功能。-Labview using the formula node to achieve the function to determine the prime numbers.
HNU-12043-Prime-NumberAgain
- HNU 12043 的源代码。 核心代码为快速筛选素数-HNU 12043 source code. Rapid screening of the core code for the prime number
prime
- PRIME NUMBER PROGRAM GENERATION
Large-prime
- 在密码学中，大素数分解是一个难题，同样大素数的生成在素性检测中也是一个难点，本文主要围绕这个中心点展开-In cryptography, a large prime number decomposition is a problem, as the generation of large prime numbers primality testing is also in a difficult, this paper started around this central point
Prime
- This a Program that computes nth Prime number-This is a Program that computes nth Prime number
Prime-judgment
- Prime judgment , you can get an integer jugded if it is an prime number after you put it in.
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A
Prime-number-generation
- 使用分段筛法，产生一定数值以内的所有素数。-use Segmented sieve method to Generate all prime numbers within a certain range of values
is-it-prime
- 判断一个数是否是素数的小程序，经过编译即可使用-Determine if a number is prime number of small programs compiled can be used
Prime-number-program-in-c-language
- this program is to check the number is prime or not
prime
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 */ -Determine 101-200 between the number of primes, and output of all primes. A program analysis: judgment Primes: respectively removed by a number of 2 to s
Number
- 一个可以从指定范围内，找出质数于非质数的小程序-One can start with the specified range, identify the number on the non-prime number small program
Quick-Prime
- Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.-Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.